On (1, 2)-step competition graphs of bipartite tournaments
نویسندگان
چکیده
In this paper, we study (1, 2)-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the (1, 2)-step competition graph of a bipartite tournament has at most one non-trivial component or consists of exactly two complete components of size at least three and, especially in the former, the diameter of the nontrivial component is at most three if it exists. Based on this result, we show that, among the connected non-complete graphs which are triangle-free or the cycles of which are edge-disjoint, K1,4 is the only graph that can be represented as the (1, 2)-step competition graph of a bipartite tournament. We also completely characterize a complete graph and the disjoint union of two complete graphs, respectively, which can be represented as the (1, 2)-step competition graph of a bipartite tournament. Finally we present the maximum number of edges and the minimum number of edges which the (1, 2)-step competition graph of a bipartite tournament might have.
منابع مشابه
Feedback arc set in bipartite tournaments is NP-complete
The Feedback Arc Set problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We show that Feedback Arc Set is NPcomplete for bipartite tournaments, that is, directed graphs that are orientations of complete bipartite graphs.
متن کاملThe (1, 2)-step competition graph of a tournament
The competition graph of a digraph, introduced by Cohen in 1968, has been extensively studied. More recently, in 2000, Cho, Kim and Nam defined the m-step competition graph. Here, we offer another generalization of the competition graph. We define the (1,2)-step competition graph of a digraph D, denoted C1,2(D) , as the graph of V(D) where {x,y} is an element of E(C1,2(D)) if and only if there ...
متن کاملA classification of arc-locally semicomplete digraphs
Tournaments are without doubt the best studied class of directed graphs [3, 6]. The generalizations of tournaments arise in order to extend the well-known results on tournaments to more general classes of directed graphs. Moreover, the knowledge about generalizations of tournaments has allowed to deepen our understanding of tournaments themselves. The semicomplete digraphs, the semicomplete mul...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 232 شماره
صفحات -
تاریخ انتشار 2017